The subgraph isomorphism problem involves finding a pattern\udgraph inside a target graph. We present a new bit- and thread-parallel\udconstraint-based search algorithm for the problem, and experiment on a\udwide range of standard benchmark instances to demonstrate its effective-\udness. We introduce supplemental graphs, to create implied constraints.\udWe use a new low-overhead, lazy variation of con\udict directed backjump-\uding which interacts safely with parallel search, and a counting-based\udall-different propagator which is better suited for large domains.
展开▼
